材料随机梁的有限元分析

提出一种以柔度为基础的具有随机刚度弯曲梁的有限元公式。在计算过程中 ,用与刚度均值有关的内力近似表示未知内力值。通过蒙特卡罗模拟可示出刚度的一维可靠性密度函数和相关函数 ,可用来估算柔度的均值和协方差函数。最后根据新的公式计算出随机梁的均值和协方差。     

药物效用鉴定的序贯抽样检验方法和条件推导

给出了制定药物效用鉴定的序贯抽样检验方案,对未用的同类药品进行随机抽样,利用抽样结果,对剩下的N-n个样品的性能进行推断,得到判断药品是否失效的抽样方法以及有效的抽样截断方案,在减小抽样量的前提下,准确的判断药物是否有效.并对该序贯抽样性能的优劣与固定样本最优检验方法进行了比较,得到在犯同样错误的前提下,序贯抽样检验的样本量比固定样本最优检验的样本量小的多.     

几类特殊多叶函数的极值点和支撑点

设S(p,α)、C(p,α)及K(p,α)分别表示α阶的p 叶星像、凸像和近于凸函数族。本文对这些函数族的支撑点和S(p,α)的从属函数族的极值点和支撑点进行了研究,推广了Grassmann 和Perera 等人的结果。     

More on the search for an infiltrator

We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 ? z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

基于差分法的二阶微分方程的模糊边值问题

本文讨论二阶微分方程的两点边值具有模糊不确定性时 ,运用模糊仿真原理和差分方法 ,求其边值问题的数值解法。     

最大避障圆问题的提出与初探

提出了一个在有界区域内求对已知各障碍物的最大避障圆问题。首先给出此问题的数学描述,然后分析了当有界区域为圆域,并将各障碍物看成一个有限点集时,避障圆的基本性质,从而得到一种求最大避障圆的有效算法。     

冲激电源作用于动态电路后初始值的求法

总结了冲激电源作用于动态电路后初始值求法的一些常见算法。针对这些算法的不足,论述了一种新的算法。     

关于细鞍点与细焦点的一般变换

各种变换在平面多项式系统的定性研究中是非常重要的。通过对鞍点量和焦点量计算时常用的变换进行研究,得到了两类把细鞍点化为细焦点的一般变换,并利用其中的一类推导出了不含二次项的三次系统的鞍点量和可积条件。     

平面图形对象拾取算法研究

介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。